OC: An Optimal Cache Algorithm for Video Staging
نویسندگان
چکیده
The video content for on-demand services is generally stored and streamed in a compressed format. The compressed video is naturally with the VBR (variable-bit-rate) property and the stream traffic is highly burst. Subject to the QoS-guaranteed playback, the WAN bandwidth needs to allocate the video's peak bit rate if there is no client buffer for regulating the video delivery [7][8][9][10][11]. To reduce the requirement of WAN bandwidth, Video Staging [2], first proposed by Zhang et al., caches parts of a video content in the video proxy closed to clients. Therefore, the video can be streamed across the WAN with CBR (constant-bit-rate) services and its bandwidth requirement is significantly reduced. In this paper, we propose an Optimal Caching (OC) algorithm to handle the Video Staging problem. We also prove that the cache storage computed by our OC algorithm is minimal. Relatively, if the same cache size is given, OC requires less WAN bandwidth than [2] does to provide streaming services. By doing experiments on several benchmark videos [12], we show that the OC algorithm can reduce the cache storage requirement by over 30% while comparing to [2]. With the same proxy cache storage of [2], we can reduce the WAN bandwidth requirement with more than 50%. Additionally, the WAN bandwidth utilization can also be increased by over 30%. Index terms – Video Staging, VBR (variable-bit-rate), CBR (constant-bit-rate), Video Proxy, and Optimal Caching (OC).
منابع مشابه
An optimal cache algorithm for streaming VBR video over a heterogeneous network
High quality video content for on-demand services is usually stored and streamed in a compressed format with a VBR (variable bit rate) property; however, the streaming traffic is extremely bursty. If there is no client buffer to regulate the video’s delivery, the backbone WAN (wide area network) bandwidth needs to allocate the video’s peak bit rate to guarantee playback quality. To reduce the b...
متن کاملPSC: a priority selected cache algorithm for streaming video over Internet
Proxy technology is commonly used a t boundaries of ISPs (Internet Service Providers) to reduce the bandwidth requirement in the backbone WAN. By caching portions of a video in a video proxy closed to clients, the video playback quality can be dramatically improved and the problem of insufficient WAN bandwidth is eliminated. In the loss-less nehvork environment, the OC (Optimal Cache) algorithm...
متن کاملThe Feedback Based Mechanism for Video Streaming Over Multipath Ad Hoc Networks
Ad hoc networks are multi-hop wireless networks without a pre-installed infrastructure. Such networks are widely used in military applications and in emergency situations as they permit the establishment of a communication network at very short notice with a very low cost. Video is very sensitive for packet loss and wireless ad-hoc networks are error prone due to node mobility and weak links. H...
متن کاملCache-oblivious Algorithms Cache-oblivious Algorithms Acknowledgments
This thesis presents “cache-oblivious” algorithms that use asymptotically optimal amounts of work, and move data asymptotically optimally among multiple levels of cache. An algorithm is cache oblivious if no program variables dependent on hardware configuration parameters, such as cache size and cache-line length need to be tuned to minimize the number of cache misses. We show that the ordinary...
متن کاملCache - Oblivious Algorithms by Harald Prokop
This thesis presents “cache-oblivious” algorithms that use asymptotically optimal amounts of work, and move data asymptotically optimally among multiple levels of cache. An algorithm is cache oblivious if no program variables dependent on hardware configuration parameters, such as cache size and cache-line length need to be tuned to minimize the number of cache misses. We show that the ordinary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002